Opportunities for aircraft controls research

Several problems which drive aircraft control technology are discussed. Highly unstable vehicles, flutter speed boundary expansion, and low level automated flight that follows terrain are discussed

Integrated controls/structures study of advanced space systems

A cost tradeoff is postulated for a stiff structure utilizing minimal controls (and control expense) to point and stabilize the vehicle. Extra costs for a stiff structure are caused by weight, packaging size, etc. Likewise, a more flexible vehicle should result in reduced structural costs but increased costs associated with additional control hardware and data processing required for vibration control of the structure. This tradeoff occurs as the ratio of the control bandwidth required for the mission to the lowest (significant) bending mode of the vehicle. The cost of controlling a spacecraft for a specific mission and the same basic configuration but varying the flexibility is established

EXPLAINING DIFFERENCES IN PRICES RECEIVED BY FARMERS: TESTING THEORY BASED ON ACTUAL FARMER TRANSACTIONS

There has been considerable normative research about how farmers should make marketing decisions, but little positive research on what farmers really do. Regressions of gender, total volume, timing, and frequency of sales on the average weighted price received are used to test hypotheses regarding gender differences, myopic loss aversion, economies of size, and market efficiency.Marketing,

Design of the Annular Suspension and Pointing System (ASPS) (including design addendum)

The Annular Suspension and Pointing System is an experiment pointing mount designed for extremely precise 3 axis orientation of shuttle experiments. It utilizes actively controlled magnetic bearing to provide noncontacting vernier pointing and translational isolation of the experiment. The design of the system is presented and analyzed

Development of the cancer-related loneliness assessment tool:Using the findings of a qualitative analysis to generate questionnaire items

The aim of this research was to develop a tool to identify and assess the qualities of cancer-related loneliness in adult cancer survivors who have completed treatment. In addition to reporting the development of the tool, we explicate the process of using the findings of a qualitative analysis to generate questionnaire items, as currently little guidance exists on this topic. The findings of our qualitative research exploring the experience of loneliness in adult cancer survivors who had completed treatment, together with the findings of our concept analysis of loneliness, were used to develop an assessment tool for cancer-related loneliness following treatment completion. Cognitive testing was undertaken to assess fidelity of comprehension and feasibility in administration. The Cancer-Related Loneliness Assessment Tool is a 10-item self-report questionnaire capturing the essential elements of cancer-related loneliness following treatment completion. Experts believed the questionnaire to be face-valid and usable in clinical practice, and preliminary cognitive testing indicated that the items generate the information intended and individuals have little trouble completing the tool. Following further development work, the tool could be employed to identify cancer-related loneliness following treatment completion. It could also aid with the development/adaptation and evaluation of person-centred interventions to address such loneliness.</p

Late-Time Behavior of Stellar Collapse and Explosions: I. Linearized Perturbations

Problem with the figures should be corrected. Apparently a broken uuencoder was the cause.Comment: 16pp, RevTex, 6 figures (included), NSF-ITP-93-8

NLC-2 graph recognition and isomorphism

NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is simple to understand. The above properties and algorithm allow us to propose a robust $O(n^2 m)$-time isomorphism algorithm for NLC-2 graphs. As far as we know, it is the first polynomial-time algorithm.Comment: soumis \`{a} WG 2007; 12